Convergence of a normalized gradient algorithm for computing ground states
نویسندگان
چکیده
منابع مشابه
Computing Ground States of Spin-1 Bose-Einstein Condensates by the Normalized Gradient Flow
In this paper, we propose an efficient and accurate numerical method for computing the ground state of spin-1 Bose–Einstein condensates (BECs) by using the normalized gradient flow or imaginary time method. The key idea is to find a third projection or normalization condition based on the relation between the chemical potentials so that the three projection parameters used in the projection ste...
متن کاملComputing the Ground State Solution of Bose-Einstein Condensates by a Normalized Gradient Flow
In this paper, we prove the energy diminishing of a normalized gradient flow which provides a mathematical justification of the imaginary time method used in physical literatures to compute the ground state solution of Bose-Einstein condensates (BEC). We also investigate the energy diminishing property for the discretization of the normalized gradient flow. Two numerical methods are proposed fo...
متن کاملA normalized gradient algorithm for an adaptive recurrent perceptron
A normalized algorithm for on-line adaptation of a recurrent perceptron is derived. The algorithm builds upon the normalized backpropagation (NBP) algorithm for feedforward neural networks, and provides an adaptive learning rate and normalization for a recurrent perceptron learning algorithm. The algorithm is based upon local linearization about the current point in the state-space of the netwo...
متن کاملA SIMPLE ALGORITHM FOR COMPUTING TOPOLOGICAL INDICES OF DENDRIMERS
Dendritic macromolecules’ have attracted much attention as organic examples of well-defined nanostructures. These molecules are ideal model systems for studying how physical properties depend on molecular size and architecture. In this paper using a simple result, some GAP programs are prepared to compute Wiener and hyper Wiener indices of dendrimers.
متن کاملA SIMPLE ALGORITHM FOR COMPUTING DETOUR INDEX OF NANOCLUSTERS
Let G be the chemical graph of a molecule. The matrix D = [dij ] is called the detour matrix of G, if dij is the length of longest path between atoms i and j. The sum of all entries above the main diagonal of D is called the detour index of G. In this paper, a new algorithm for computing the detour index of molecular graphs is presented. We apply our algorithm on copper and silver nanoclusters ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IMA Journal of Numerical Analysis
سال: 2017
ISSN: 0272-4979,1464-3642
DOI: 10.1093/imanum/drx009